On homomorphisms, correctness, termination, unfoldments, equivalence of flow diagram programs
نویسندگان
چکیده
منابع مشابه
Kernel Equivalence of Programs and Proving Kernel Equivalence and Correctness by Test Cases
The statements in a program may be classi fied as "kernel statements" if they participate d i rect ly in the computation of some output and as "control statements" if they participate di rect ly in deciding the control path at branch points. Two programs are kernel equivalent if they always execute identical sequences of kernel statements given the same inputs. Kernel equivalence is defined fo...
متن کاملOn behavior homomorphisms and system equivalence
In this paper we introduce the concept of a behavior homomorphisms and isomorphisms and use it to present a uni.ed approach to the study of equivalence of di/erent behavior representations concentrating on a special representation we call normalized ARMA (NARMA) representation. c © 2001 Elsevier Science B.V. All rights reserved.
متن کاملOn Observational Equivalence and Compiler Correctness
We study the problem of giving proofs of compiler correctness in the framework of observational equivalence 16] and correspondences 17]. The starting point for correctness is a formal semantics of the programming language given in a form of Structural Operational Semantics 15] wich we call Relational Semantics 4, Chapter 2]. We start by introducing Relational Semantics. We then deene an equival...
متن کاملOn Termination of Meta-Programs
The termmeta-programming refers to the ability of writing programs that have other programs as data and exploit their semantics [4]. The choice of logic programming as a basis for meta-programming offers a number of practical and theoretical advantages. One of them is the possibility of tackling critical foundation problems of meta-programming within a framework with a strong theoretical basis....
متن کاملCorrectness of Logic Program Transformations Based on Existential Termination
We study the relationships between the correctness of logic program transformation and program termination. We consider deenite programs and we identify somèinvariants' of the program transformation process. The validity of these invariants ensures the preservation of the success set semantics, provided that the existential termination of the initial program implies the existential termination ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1974
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(74)80028-0